Termination w.r.t. Q proof of TRS/Endrullislabeling.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₃(f₃(x, y, a), z, w) -> f₃(z, w, f₃(y, x, z))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₃(f₃(x, y, a), z, w) -> f₃(z, w, f₃(y, x, z))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F₃(f₃(x, y, a), z, w) -> F₃(y, x, z)
F₃(f₃(x, y, a), z, w) -> F₃(z, w, f₃(y, x, z))

The TRS R consists of the following rules:

f₃(f₃(x, y, a), z, w) -> f₃(z, w, f₃(y, x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(f₃(x, y, a), z, w) -> F₃(y, x, z)
F₃(f₃(x, y, a), z, w) -> F₃(z, w, f₃(y, x, z))

The TRS R consists of the following rules:

f₃(f₃(x, y, a), z, w) -> f₃(z, w, f₃(y, x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.